Complexity of Estimating Multi - way Join
نویسندگان
چکیده
In a real life environment, spatial data is highly skewed. In general, there are two kinds of skews in spatial data. One is the placement skew and the other is the area skew. This paper introduces methods and the complexity of estimating the result sizes of the multi-way join for the area skewed spatial data. Especially, this paper describes the number and sort of the statistics which the optimizer should keep in order to calculate the multi-way join result size.
منابع مشابه
Complexity of estimating multi-way join result sizes for area skewed spatial data
In a real life environment, spatial data is highly skewed. In general, there are two kinds of skews in spatial data. One is the placement skew and the other is the area skew. This paper introduces methods and the complexity of estimating the result sizes of the multi-way join for the area skewed spatial data. Especially, this paper describes the number and sort of the statistics which the optim...
متن کاملOn Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern database applications involving geospatial data such as GIS, efficient evaluation of joins with other spatial predicates is yet to be fully explored. In addition, most existing join algorithms were developed for two-way joi...
متن کاملMeasuring the Complexity of Join Enumeration in Query Optimization
Since relational database management systems typically support only diadic join operators as primitive operations, a query optimizer must choose the “best” scquence of two-way joins to achieve the N-way join of tables requested by a query. The computational complexity of this optimization process is dominated by the number of such possible sequences that must bc evaluated by the optimizer. This...
متن کاملAn Efficient Multi Join Algorithm Utilizing a Lattice of Double Indices
In this paper, a novel multi join algorithm to join multiple relations will be introduced. The novel algorithm is based on a hashed-based join algorithm of two relations to produce a double index. This is done by scanning the two relations once. But instead of moving the records into buckets, a double index will be built. This will eliminate the collision that can happen from a complete hash al...
متن کاملA Multi Join Algorithm Utilizing Double Indices
Join has always been one of the most expensive queries to carry out in terms of the amount of time to process. This paper introduces a novel multi join algorithm to join multiple relations. The novel algorithm is based on a hashed-based join of two relations to produce a double index. This is done by scanning the two relations once. Instead of moving the records into buckets, a double index is ...
متن کامل